Extended Abstract: Dynamic Proof Pages
نویسندگان
چکیده
Reading a formal proof script written in a procedural (command-driven) style is difficult, bordering on impossible, without access to an interpreter for the script, that generates the states based on the commands. The Proviola system replaces the need for this interpreter, storing responses and displaying them on-demand. This abstract describes a natural extension to the Proviola: instead of working on plain text files, the improved system takes an HTML rendering of the script, and decorates it with the proof states. The decorated page can be used as a Wiki page, generated out of a script file.
منابع مشابه
Declarative Graphics And Dynamic Interaction
First order logic provides a means of integrating the speciication and prototyping of interactive systems. It can describe graphical images in a declarative and order independent manner. It supports the deenition of abstract devices which avoid the complexity of representing`raw' input from a variety of physical devices. The following pages show how such techniques must be extended in order to ...
متن کاملGoogling the Deep Web (Extended abstract)
The Deep Web is constituted by data that are accessible through Web pages, but not indexable by search engines as they are returned in dynamic pages. In this paper we propose a conceptual framework for answering keyword queries on Deep Web sources represented as relational tables with so-called access limitations. We formalize the notion of optimal answer and characterize queries for which an a...
متن کاملModelling of an Optimal Membrane with Patches
Extended Abstract Paper pages (21-34)./files/site1/files/41/2Extended_Abstract.pdf
متن کاملA Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
P. Samarati, D. Gollmann, and R. Molva (Eds.): ESORICS 2004, LCNS 3193, pages 89 108, September 2004. c © Springer-Verlag Berlin Heidelberg 2004. Abstract. We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active attacks including concurrent protocol runs if it is implemented u...
متن کاملHierarchical Correctness Proofs for Recursive Distributed Algorithms using Dynamic Process Creation
We present a new proof methodology that uses dynamic process creation to capture the structure of recutsive distributed algorithms> Each recursive invocation of a distributed algorithm is modeled as a separate process, encouraging local reasoning about the individual recursive invocations and making explicit the communicatino that takes place among the concurrently executing invocations. Our me...
متن کامل